Valiant-Vazirani Lemmata for Various Logics
نویسنده
چکیده
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as those of the A-hierarchy. We do so by proving a general “logical” version of it which may be of independent interest.
منابع مشابه
Valiant-Vazirani theorem
Leslie G. Valiant and Vijay V. Vazirani in 1986 wrote a paper with the name ‘NP is as Easy as Detecting Unique Solutions’ [?]. The theorem they proved became the classical theorem in the complexity theory, so sometimes it’s even called a lemma instead of a theorem. In this text it will be presented the statement of the theorem, two different proofs, and also it would be some discussion. Both L....
متن کاملIs the Valiant-Vazirani Isolation Lemma Improvable?
The Valiant-Vazirani Isolation Lemma [TCS, vol. 47, pp. 85–93, 1986] provides an efficient procedure for isolating a satisfying assignment of a given satisfiable circuit: given a Boolean circuit C on n input variables, the procedure outputs a new circuit C ′ on the same n input variables with the property that the set of satisfying assignments for C ′ is a subset of those for C, and moreover, i...
متن کاملUniform Generation of NP-Witnesses Using an NP-Oracle
Uniform Generation of NP-witnesses using an NP-oracle Mihir Bellare Oded Goldreichy Erez Petrankz May 1998 Abstract A Uniform Generation procedure for NP is an algorithm which given any input in a xed NP-language, outputs a uniformly distributed NP-witness for membership of the input in the language. We present a Uniform Generation procedure for NP that runs in probabilistic polynomial-time wit...
متن کاملBoolean complexity classes vs. their arithmetic analogs
This paper provides logspace and small circuit depth analogs of the result of Valiant and Vazirani, which is a randomized (or nonuniform) reduction from NP to its arithmetic analog ⊕P . We show a similar randomized reduction between the Boolean classes NL and semiunbounded fan-in Boolean circuits and their arithmetic counterparts. These reductions are based on the Isolation Lemma of Mulmuley, V...
متن کاملUniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable
Let (k, s)-SAT refer the family of satisfiability problems restricted to CNF formulas with exactly k distinct literals per clause and at most s occurrences of each variable. Kratochv́ıl, Savický and Tuza [6] show that there exists a function f(k) such that for all s ≤ f(k), all (k, s)-SAT instances are satisfiable whereas for k ≥ 3 and s > f(k), (k, s)-SAT is NP-complete. We define a new functio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 15 شماره
صفحات -
تاریخ انتشار 2008